#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
class Solution {
public:
	vector<int> twoSum(vector<int>& numbers, int target) {
		unordered_map<int, int> hash;
		for (int i = 0; i < numbers.size(); i++) {
			int numberToFind = target - numbers[i];
			if (hash.find(numberToFind) != hash.end())
				return vector<int>{hash[numberToFind], i + 1 };
			hash[numbers[i]] = i + 1;
		}
		return vector<int>{};
	}
};
int main()
{
	
}